Linear Equation Solvers

نویسنده

  • F. J. MURRAY
چکیده

In one type the 6,are fed into the machine in such a way as to drive the unknowns Xj to their correct values. In the second type, the xf are not driven by power supplied from the constant inputs but reach an equilibrium situation corresponding to the solution by a process of adjustment. We are concerned in this article with the operating conditions for this last type of machine when the adjusting process is determined by a linear operator with constant coefficients. We suppose that each a,-,can run independently through a real range which contains the origin. Thus, the determinant may be zero and any matrix can be represented by a suitable choice of scale for the unknowns and the £>,. Adjusting machines which are stable even when the determinant is zero may be designed. For instance, a block diagram is given in the author's book1 for such a machine. Another example is the set-up described by Goldberg and Brown2 which will insure stability when a certain type of feedback is used. However, in each case the coefficient network is duplicated. In the present article, we point out that if an adjusting type of machine is to operate successfully whenever the determinant A is not zero, then the square of the determinant must enter the indicial equation of the equations of motion for the machine. This necessary condition for successful operation rules out any linear feedback which does not involve using the a,-,twice. This result generalizes certain aspects of the necessity argument indicated in Goldberg and Brown. In Sees. 2 and 3 below, we describe precisely the type of machine we are concerned with. These machines may function continuously or in discrete steps. In Sees. 4 and 5 we obtain necessary and sufficient conditions that the machine should operate successfully in all cases where a solution is uniquely determined. These conditions are analogous to stability conditions for a linear network. In the case of a continuous machine, this analogy is readily established; in the case of a discrete step machine, these operational conditions are obtained by considering certain parts of the theory of linear difference equations. In Sec. 6 we prove the mathematical theorem upon which our result is based. It is shown in Sec. 7 that an adjusting machine with a linear feedback network, which is independent of the coefficients of the equations, will not always operate successfully. Section 8 contains the mathematical basis for Sec. 5 which is concerned with discrete step machines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Solution Methods in Electromagnetics - Antennas and Propagation, IEEE Transactions on

Various methods for efficiently solving electromagnetic problems are presented. Electromagnetic scattering problems can be roughly classified into surface and volume problems, while fast methods are either differential or integral equation based. The resultant systems of linear equations are either solved directly or iteratively. A review of various differential equation solvers, their complexi...

متن کامل

Using iterative linear solvers in non linear continuation algorithm

Some techniques to solve non linear algebraic equations in nite element analysis are considered Especially the use of preconditioned iterative linear equation solvers in path following algorithms is described and the choice of an accelerator iteration and the preconditioner are discussed Some preliminary results are presented from structural analyses

متن کامل

Solution of Dense Systems of Linear Equations Arising from Integral Equation Formulations

|This paper discusses eecient solution of dense systems of linear equations arising from integral equation formulations. Several preconditioners in connection with Krylov iterative solvers are examined and compared with LU factorization. Results are shown demonstrating practical aspects and issues we have encountered in implementing iterative solvers on both parallel and sequential computers.

متن کامل

Evaluation of the linear matrix equation solvers in SLICOT

We discuss solvers for Sylvester, Lyapunov, and Stein equations that are available in the SLICOT Library (Subroutine Library In COntrol Theory). These solvers offer improved efficiency, reliability, and functionality compared to corresponding solvers in other computer-aided control system design packages. The performance of the SLICOT solvers is compared with the corresponding MATLAB solvers. T...

متن کامل

Performance of Parallel Conjugate Gradient Solvers in Meshfree Analysis

Meshfree analysis methods, on a per degree of freedom basis, are typically more computationally expensive and yet more accurate than finite element methods. For very large models, whether meshfree or finite element, the memory and computational effort associated with direct equation solvers makes them prohibitively expensive. In this work, the performance of different linear equation solvers wi...

متن کامل

Computational Experience in Solving Large Linear Matrix Equations for Automatic Control

State-of-the-art, uni-processor linear matrix equation solvers for automatic control computations are investigated and compared for various problem sizes. Generalpurpose SLICOT solvers are the most efficient ones for small-size problems, but they cannot compete for larger problems with specialized solvers designed for certain problem classes. Copyright c ©2004 IFAC

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016